基于概念模型的仿真模型调度决策法

仿真模型调度决策是实现仿真结果合理、可信、可用的重要环节。界定了模型调度决策问题域,引入了模型调度序列表示决策结果,提出了基于UML(unified modeling language)概念模型的模型调度决策法,分析了防空作战仿真模型调度决策示例,为解决舰艇作战仿真模型的调度决策提供可行办法,对复杂军事问题仿真模型调度决策具有一定的理论意义。     

新型技术设备在护照证件识别中的应用

在各种偷渡行为中,持用伪假护照证件非法出入境是犯罪分子最常用的手段,随着新技术的发展,其伪造手段也向高技术、专业化方向发展。因此,提升护照证件的防伪技术,运用先进技术及新型设备鉴别伪假护照证件,已成为边防管理工作的关键所在。结合现阶段口岸查验中出现的伪假护照证件的主要造假手段,对先进技术及设备在边防检查工作中的应用进行了一些有益探索。     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

【专题】智能化导弹质量检测方法研究

导弹是由各种类型装备组成的综合性很强的复杂系统,智能技术的引入进一步丰富了智能导弹质量特性的内涵,对质量检测和控制提出了更高要求,需要开发与之相适应的检测方法。本文先给出了智能导弹的定义和内涵,分析了其智能特性,接着概述了智能化导弹的结构组成,分析了各智能部件的功能和结构组成,从智能化导弹结构组成及测试参数、智能化部件的嵌入式软件作用、零部件机械加工精度等方面提出了智能化导弹质量检测的需求,并在此基础上结合智能化制造等技术提出了在线检测、自动检测/测试、BIT自检、软件测评技术以及弹载遥测的智能化导弹质量检测途径和方法。     

玻璃瓶动态图像检测运动模拟平台

动态图像检测中,如何在指定位置快速而准确地捕捉到运动物体的图像是最基本的环节。试验验证图像检测装置的成像特性,成为动态图像检测研究的重要内容之一。以变频器控制电动机为核心,通过变频器内部参数编程和外部简单的辅助控制电路,构建了运动平稳、速度可调、具有自动保护功能的模拟平台。该平台适于动态图像检测中普通运动物体的快速模拟,已成功地用于玻璃瓶动态图像装置中,达到了预期目的。     

链约束下加工时间恶化的Flow Shop排序问题

讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。     

卫星任务调度问题的约束规划模型

卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。     

C2组织结构设计:平台-任务关系设计

以联合作战战役为例建立作战平台和任务模型,对C2(Command and Control)组织结构设计中平台-任务关系设计问题分析了传统多维动态列表规划算法(Multidimensional Dynamic List Scheduling,MDLS)在解决作战平台资源调度(平台-任务分配)问题的不足,提出了在平台-任务分配过程中采用任务选择平台组、平台选择任务以及两者选择冲突消除改进的MDLS算法,以解决MDLS算法的不足,并对不同方法的结果进行了比较.     

Relaxed sequencing games have a nonempty core

We study sequencing situations with a fixed initial order and linear cost functions. Cost savings can be obtained by rearranging jobs. Next to finding an optimal order, an additional issue is formed by the division of these savings. Cooperative game theory studies this issue. A common assumption states that cooperation between players is restricted to groups that are connected according to the initial order. The value of disconnected groups is defined additively over their connected components. In this paper we allow players in disconnected coalitions to switch places as long as they do not hurt the players not in the coalition under consideration. The resulting games are called relaxed sequencing games. Although they have been studied before, no general results on stable profit divisions have been derived so far. In this paper we prove that relaxed sequencing games have a nonempty core, i.e., they all have stable profit divisions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006